General models in min-max planar location: Checking optimality conditions
نویسندگان
چکیده
منابع مشابه
Min-max-min Geometric Facility Location Problems
We propose algorithms for a special type of geometric facility location problem in which customers may choose not to use the facility. We minimize the maximum cost incurred by a customer, where the cost itself is a minimum between two costs, according to whether the facility is used or not. We therefore call this type of location problem a min-max-min geometric facility location problem. As a f...
متن کاملOn the optimality of max-min fairness in resource allocation
In this work a basic Resource Allocation (RA) problem is considered, where a fixed capacity must be shared among a set of users. The RA task can be formulated as an optimization problem, with a set of simple constraints and an objective function to be minimized. A fundamental relation between the RA optimization problem and the notion of max-min fairness is established. A sufficient condition o...
متن کاملMax-Margin Min-Entropy Models
We propose a new family of latent variable models called max-margin min-entropy (m3e) models, which define a distribution over the output and the hidden variables conditioned on the input. Given an input, an m3e model predicts the output with the smallest corresponding Rényi entropy of generalized distribution. This is equivalent to minimizing a score that consists of two terms: (i) the negativ...
متن کاملApproximate Min-max Relations for Odd Cycles in Planar Graphs
We study the ratio between the minimum size of an odd cycle vertex transversal and the maximum size of a collection of vertex-disjoint odd cycles in a planar graph. We show that this ratio is at most 10. For the corresponding edge version of this problem, Král and Voss recently proved that this ratio is at most 2; we also give a short proof of their result.
متن کاملMin-Max Relations for Odd Cycles in Planar Graphs
Let ν(G) be the maximum number of vertex-disjoint odd cycles of a graph G and τ(G) the minimum number of vertices whose removal makes G bipartite. We show that τ(G) ≤ 6ν(G) if G is planar. This improves the previous bound τ(G) ≤ 10ν(G) by Fiorini, Hardy, Reed and Vetta [Math. Program. Ser. B 110 (2007), 71–91].
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Optimization Theory and Applications
سال: 1996
ISSN: 0022-3239,1573-2878
DOI: 10.1007/bf02192641